On Categorial Membership

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Membership Problem for Non-Linear Abstract Categorial Grammars

In this paper we show that the membership problem for second order nonlinear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an inter...

متن کامل

A Polynomial Algorithm for the Membership Problem with Categorial Grammars

This article presents an overview of a framework called categorial grammars from a theoretical and algorithmic perspective. It provides an introduction to the formalisms of these grammars and of the tools they use (the Lambek Calculus) for theoretical computer scientists who are not familiar with them. We give a clear presentation of the main classical and recent results on these grammars, espe...

متن کامل

Categorial and Non-Categorial Languages

Computer Science Department Boston University 111 Cummington Street Boston, Massachusetts 02215 USA

متن کامل

Memoisation of Categorial Proof Nets: Parallelism in Categorial Processing 1 Memoisation of Categorial Proof Nets: Parallelism in Categorial Processing

We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-commutative proof nets, and uni ability as a correctness criterion, parallelism is simulated through construction of a proof net matrix of most general uni ers for modules, in a manner analogous to the Cocke-Younger-Kasami algorithm for context free grammar. 1 Memoisation of categorial proof nets: par...

متن کامل

On Membership Comparable Sets

A set A is k(n) membership comparable if there is a polynomial time computable function that, given k(n) instances of A of length at most n, excludes one of the 2 k(n) possibilities for the memberships of the given strings in A. We show that if SAT is O(log n) membership comparable, then UniqueSAT 2 P. This extends the and answers in the aarmative an open question suggested by Buhrman, Fortnow,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Erkenntnis

سال: 2013

ISSN: 0165-0106,1572-8420

DOI: 10.1007/s10670-013-9584-7